Duality respecting representations and compatible complexity measures for gammoids

We show that every gammoid has special digraph representations, such that a representation of the dual of the gammoid may be easily obtained by reversing all arcs. In an informal sense, the duality notion of a poset applied to the digraph of a special representation of a gammoid commutes with the operation of forming the dual of that gammoid. We use these special representations in order to define a complexity measure for gammoids, such that the classes of gammoids with bounded complexity are closed under duality, minors, and direct sums.     

Formal proofs of operator identities by a single formal computation

A formal computation proving a new operator identity from known ones is, in principle, restricted by domains and codomains of linear operators involved, since not any two operators can be added or composed. Algebraically, identities can be modelled by noncommutative polynomials and such a formal computation proves that the polynomial corresponding to the new identity lies in the ideal generated by the polynomials corresponding to the known identities. In order to prove an operator identity, however, just proving membership of the polynomial in the ideal is not enough, since the ring of noncommutative polynomials ignores domains and codomains. We show that it suffices to additionally verify compatibility of this polynomial and of the generators of the ideal with the labelled quiver that encodes which polynomials can be realized as linear operators. Then, for every consistent representation of such a quiver in a linear category, there exists a computation in the category that proves the corresponding instance of the identity. Moreover, by assigning the same label to several edges of the quiver, the algebraic framework developed allows to model different versions of an operator by the same indeterminate in the noncommutative polynomials.     

Linear independence of a finite set of time-frequency shifts

This paper introduces an open conjecture in time-frequency analysis on the linear independence of a finite set of time-frequency shifts of a given L² function. Firstly, background and motivation for the conjecture are provided. Secondly, the main progress of this linear independence in the past twenty five years is reviewed. Finally, the partial results of the high dimensional case and other cases for the conjecture are briefly presented.     

QK乘子代数上的Corona定理和Wolff定理

本文给出对数K-Carleson测度的一个新特征,并以此为工具研究Q_K空间的乘子代数M(Q_K),给出乘子代数M(Q_K)的某些特征描述.利用对数K-Carleson测度及Q_K空间的一个新特征,建立乘子代数M(Q_K)上的Corona定理和Wolff定理.     

Sufficient Conditions for a Digraph to be Supereulerian

A (di)graph is supereulerian if it contains a spanning eulerian sub(di)graph. This property is a relaxation of hamiltonicity. Inspired by this analogy with hamiltonian cycles and by similar results in supereulerian graph theory, we analyze a number of sufficient Ore type conditions for a digraph to be supereulerian. Furthermore, we study the following conjecture due to Thomassé and the first author: if the arc‐connectivity of a digraph is not smaller than its independence number, then the digraph is supereulerian. As a support for this conjecture we prove it for digraphs that are semicomplete multipartite or quasitransitive and verify the analogous statement for undirected graphs.